The maximum weight ({K1,K2},k,l)-packing problem in a graph

Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem

Consider a point-set coming from an object which was sampled using a digital sensor (depth range, camera, etc). We are interested in finding a graph that would represent that point-set according to some properties. Such a representation would allow us to match two objects (graphs) by exploiting topological properties instead of solely relying on geometrical properties. The Delaunay triangulatio...

The Maximum Number of Edges in a Strongly Multiplicative Graph

The Maximum Resource Bin Packing Problem

Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used or minimize the number or total size of accepted items. We consider off-line and on-line variants of the pr...

A Problem Kernelization for Graph Packing

For a fixed connected graph H , we consider the NP-complete H-packing problem, where, given an undirected graph G and an integer k ≥ 0, one has to decide whether there exist k vertex-disjoint copies of H in G. We give a problem kernel of O(k ) vertices, that is, we provide a polynomial-time algorithm that reduces a given instance of H-packing to an equivalent instance with at most O(k ) vertice...

Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach

"Protein Side-chain Packing" has an ever-increasing application in the field of bio-informatics, dating from the early methods of homology modeling to protein design and to the protein docking. However, this problem is computationally known to be NP-hard. In this regard, we have developed a novel approach to solve this problem using the notion of a maximum edge-weight clique. Our approach is ba...